Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization

نویسنده

  • Jean Charles Gilbert
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization

This paper describes a reduced quasi-Newton method for solving equality constrained optimization problems. A major difficulty encountered by this type of algorithm is the design of a consistent technique for maintaining the positive definiteness of the matrices approximating the reduced Hessian of the Lagrangian. A new approach is proposed in this paper. The idea is to search for the next itera...

متن کامل

Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms

Defining a consistent technique for maintaining the positive definiteness of the matrices generated by quasi-Newton methods for equality constrained minimization remains a difficult open problem. In this paper, we review and discuss the results obtained with a new technique based on an extension of the Wolfe line-search used in unconstrained optimization. The idea is to follow a piecewise linea...

متن کامل

A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization

A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in some recently introduced quadratic solvers. A limited-memory multipoint symmetric secant method for approximating the Hessian is presented. Positive-definiteness of the Hessian approximation is not enforced. A combina...

متن کامل

Constrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm

Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...

متن کامل

Finding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem

Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Program.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 1991